FMAC for Coexisting Ad Hoc Cognitive Radio Networks
نویسندگان
چکیده
Media access control plays a critical role in cognitive radio networks (CRNs). In our previous work, we have proposed a fairnessoriented media access control (FMAC) protocol to achieve fair and efficient coexistence of infrastructure-based CRNs. In this paper, we enhance FMAC to be used for coexisting ad hoc CRNs, where no centralized base stations exist, and secondary users (SUs) access channel independently. In FMAC, the contention window size is essential to network performance such as throughput. We first derive the optimal contention window size, which can then be used by SUs to achieve optimal throughput. However, the optimal contention window size is closely related to the total number of users of all CRNs, which is typically unknown to each individual SU of coexisting ad hoc CRNs. We attack this problem by building a bridge between the average number of consecutive idle time slots and optimal contention window size, since the average number of consecutive idle time slots can be easily observed by each individual SU. Hence, SUs can independently adjust their contention window size by observing their current average number of consecutive idle time slots and eventually approach the optimal contention window without the information of the total number of SUs. Extensive simulations are conducted and the results verify that the enhanced FMAC is able to significantly improve the fairness among coexisting ad hoc CRNs while maintaining good throughput.
منابع مشابه
Fuzzy controlled multi-hop adaptive clustering (FMAC) for mobile ad hoc networks
To mimic the operations in fixed infrastructures and to solve the routing scalability problem in large ‘mobile ad hoc networks’, forming clusters of nodes has been proven to be a promising approach. However, when existing weighted clustering algorithms calculate each node’s weight, they either consider only one metric or rely on some metrics collected from extra devices. This often leads to a h...
متن کاملBroadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملPercolation theory based connectivity and latency analysis of cognitive radio ad hoc networks
This paper investigates the dynamic connectivity and transmission latency of cognitive radio ad-hoc networks (secondary networks) coexisting with licensed networks (primary networks) that experience time-varying on-off links. It is shown that there exists a critical density ks * such that if the density of secondary networks is larger than ks , the secondary network percolates at all time t [ 0...
متن کاملRouting Protocols for Mobile Cognitive Radio Ad Hoc Networks
Ad hoc network is a collection of wireless mobile nodes that dynamically form a temporary network without the use of any existing network infrastructure or centralized administration. A cognitive radio is a radio that can change its transmitter parameters based on interaction with the environment in which it operates. The basic idea of cognitive radio networks is that the unlicensed devices (co...
متن کاملA Review of routing protocols for mobile cognitive radio ad hoc networks
Ad hoc network is a collection of wireless mobile nodes that dynamically form a temporary network without the use of any existing network infrastructure or centralized administration. A cognitive radio is a radio that can change its transmitter parameters based on interaction with the environment in which it operates. The basic idea of cognitive radio networks is that the unlicensed devices (co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013